Tim Roughgarden

Results: 191



#Item
31

CS261: A Second Course in Algorithms Lecture #20: The Maximum Cut Problem and Semidefinite Programming∗ Tim Roughgarden† March 10, 2016

Add to Reading List

Source URL: theory.stanford.edu

- Date: 2016-03-17 09:58:23
    32

    How Unfair is Optimal Routing? Tim Roughgarden∗ 1 Introduction

    Add to Reading List

    Source URL: www.cs.cornell.edu

    - Date: 2001-10-07 22:49:51
      33

      CS168: The Modern Algorithmic Toolbox Lecture #17: Compressive Sensing Tim Roughgarden & Gregory Valiant∗ May 23,

      Add to Reading List

      Source URL: theory.stanford.edu

      - Date: 2016-06-04 09:49:43
        34

        CS261: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem∗ Tim Roughgarden† February 25,

        Add to Reading List

        Source URL: theory.stanford.edu

        - Date: 2016-03-05 20:03:20
          35

          CS364B: Frontiers in Mechanism Design Lecture #17: Part II: Beyond Smoothness and XOS Valuations ∗ Tim Roughgarden† March 5, 2014

          Add to Reading List

          Source URL: theory.stanford.edu

          - Date: 2014-05-13 09:33:25
            36

            CS364B: Frontiers in Mechanism Design Lecture #4: The Clinching Auction∗ Tim Roughgarden† January 15,

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2014-01-27 13:39:49
              37

              The Price of Anarchy in an Exponential Multi-Server∗ Moshe Haviv† Tim Roughgarden‡ Abstract

              Add to Reading List

              Source URL: theory.stanford.edu

              - Date: 2006-09-14 00:31:08
                38

                Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) Tim Roughgarden∗ Sergei Vassilvitskii†

                Add to Reading List

                Source URL: theory.stanford.edu

                - Date: 2016-05-23 15:55:55
                  39

                  CS261: A Second Course in Algorithms Lecture #6: Generalizations of Maximum Flow and Bipartite Matching∗ Tim Roughgarden† January 21, 2016

                  Add to Reading List

                  Source URL: theory.stanford.edu

                  - Date: 2016-01-30 18:12:35
                    40

                    CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness∗ Tim Roughgarden† December 2, 2013

                    Add to Reading List

                    Source URL: theory.stanford.edu

                    - Date: 2013-12-19 00:51:19
                      UPDATE